Diversified top-k graph pattern matching

Diversified Top-k Graph Pattern Matching

Graph pattern matching has been widely used in e.g., social data analysis. A number of matching algorithms have been developed that, given a graph pattern Q and a graph G, compute the set M(Q,G) of matches of Q in G. However, these algorithms often return an excessive number of matches, and are expensive on large real-life social graphs. Moreover, in practice many social queries are to find mat...

Diversified Top-k Partial MaxSAT Solving

We introduce a diversified top-k partial MaxSAT problem, a combination of partial MaxSAT problem and enumeration problem. Given a partial MaxSAT formula F and a positive integer k, the diversified top-k partial MaxSAT is to find k maximal solutions for F such that the k maximal solutions satisfy the maximum number of soft clauses of F . This problem can be widely used in many applications inclu...

Generalized Graph Pattern Matching

Graphs are high expressive models and especially suitable for modelling highly complex structures, the number of applications that use them for modelling both their data and the processes that manipulate has grown dramatically in recent years. The use of new conceptual structures in real-world applications requires the development of new systems to store and query such structures in order to al...

Incremental Graph Pattern Matching

Top-k Correlative Graph Mining

Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases is expensive due to the complexity of graph data. In this paper, we study the problem of mining top-k correlative subgraphs in the database, which share similar occurrence distributions with a given query graph. The se...